Parallel EigenAnt algorithm based on MPI by ACO approach
نویسندگان
چکیده
منابع مشابه
Parallel Genetic Algorithm Based on the MPI Environment
Current genetic algorithm require both management of huge amounts of data and heavy computation, fulfilling these requirements calls for simple ways to implement parallel computing. In this paper, serial genetic algorithm was designed to parallel GA; this technology appears to be particularly well adapted to this task. Here we introduce two related mechanism: elite reserve strategy and MPI. The...
متن کاملA Parallel Clustering Algorithm with MPI - MKmeans
Clustering is one of the most popular methods for exploratory data analysis, which is prevalent in many disciplines such as image segmentation, bioinformatics, pattern recognition and statistics etc. The most famous clustering algorithm is K-means because of its easy implementation, simplicity, efficiency and empirical success. However, the real-world applications produce huge volumes of data, ...
متن کاملParallel Fast Multipole Algorithm using MPI
The simulation of many-body, many-particle system has a wide range of applications in area such as biophysics, chemistry, astrophysics, etc. It is known that the force calculation contributes ninety percent of the simulation time. This is mainly due to the fact that the total number of interactions in the force is O(N 2), where N is the number of particles in the system. The fast multipole algo...
متن کاملAnalyze the Wild Birds' Migration Tracks by MPI-Based Parallel Clustering Algorithm
Aiming at the avian influenza outbreak in Qinghai Lake area, the satellite tracking of migratory birds in Qinghai Lake is studied to analyze the relationship between bird migration, virus spread and ecological environment. These biological problems have been converted into computational studies in previous studies in which spatial clustering is the key factor. A bird migration data analysis sys...
متن کاملParallel Multicolony ACO Algorithm with Exchange of Solutions
The availability of parallel architectures at low cost, e.g. clusters of PCs connected through fast local networks like Gigabit Ethernet, has widened the interest for the parallelization of algorithms [1]. There are two reasons for parallelizing a metaheuristic if one is interested in performance: (i) given a fixed time to search, the aim is to increase the quality of the solutions found in tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications on Advanced Computational Science with Applications
سال: 2017
ISSN: 2196-2499
DOI: 10.5899/2017/cacsa-00080